CBS constants for multilevel splitting of graph-Laplacian and application to preconditioning of discontinuous Galerkin systems

The goal of this work is to derive and justify a multilevel preconditioner of optimal arithmetic complexity for symmetric interior penalty discontinuous Galerkin finite element approximations of second order elliptic problems. Our approach is based on the following simple idea given in [R.D. Lazarov, P.S. Vassilevski, L.T. Zikatanov, Multilevel preconditioning of second order elliptic discontinuous Galerkin problems, Preprint, 2005]. The finite element spaceV of piece-wise polynomials, discontinuous on the partitionT, is projected onto the space of piece-wise constant functions on the same partition that constitutes the largest space in the multilevel method. The discontinuous Galerkin finite element system on this space is associated to the so-called “graph-Laplacian”. In 2-D this is a sparseM-matrix with−1 as off diagonal entries and nonnegative row sums. Under the assumption that the finest partition is a result of multilevel refinement of a given coarse mesh, we develop the concept of hierarchical splitting of the unknowns. Then using local analysis we derive estimates for the constants in the strengthened Cauchy–Bunyakowski–Schwarz (CBS) inequality, which are uniform with respect to the levels. This measure of the angle between the spaces of the splitting was used by Axelsson and Vassilevski in [Algebraic multilevel preconditioning methods II, SIAM J. Numer. Anal. 27 (1990) 1569–1590] to construct an algebraic multilevel iteration (AMLI) for finite element systems. The main contribution in this paper is a construction of a splitting that produces new estimates for the CBS ∗ Corresponding author. Department of Mathematics, Texas A&M University, College Station, TX 77843, USA. Fax: +1 979 8624190. E-mail addresses: [email protected] (R.D. Lazarov), [email protected] (S.D. Margenov). 0885-064X/$ see front matter © 2006 Elsevier Inc. All rights reserved. doi:10.1016/j.jco.2006.10.003 R.D. Lazarov, S.D. Margenov / Journal of Complexity 23 (2007) 498–515 499 constant for graph-Laplacian. As a result we have a preconditioner for the system of the discontinuous Galerkin finite element method of optimal arithmetic complexity. © 2006 Elsevier Inc. All rights reserved.